An Active System for Dynamic Vertical Partitioning of Relational Databases
نویسندگان
چکیده
Vertical partitioning is a well known technique to improve query response time in relational databases. This consists in dividing a table into a set of fragments of attributes according to the queries run against the table. In dynamic systems the queries tend to change with time, so it is needed a dynamic vertical partitioning technique which adapts the fragments according to the changes in query patterns in order to avoid long query response time. In this paper, we propose an active system for dynamic vertical partitioning of relational databases, called DYVEP (DYnamic VErtical Partitioning). DYVEP uses active rules to vertically fragment and refragment a database without intervention of a database administrator (DBA), maintaining an acceptable query response time even when the query patterns in the database suffer changes. Experiments with the TPC-H benchmark demonstrate efficient query response time.
منابع مشابه
Dynamic Vertical Partitioning of Multimedia Databases Using Active Rules
Vertical partitioning is a design technique widely employed in relational databases to reduce the number of irrelevant attributes accessed by the queries. Currently, due to the popularity of multimedia applications on the Internet, the need of using partitioning techniques in multimedia databases has arisen in order to use their potential advantages with regard to query optimization. In multime...
متن کاملAn Overview of Vertical Partitioning in Object-Oriented Databases
In this paper, some interesting issues related to vertical partitioning in object oriented database systems are presented. A review of existing research is given with an identification of some open problems. A taxonomy of various possible partitioning schemes and a unified view of the vertical partitioning problem are also presented. Existing vertical partitioning algorithms have been studied f...
متن کاملA New Improved Vertical Partitioning Scheme for Non Relational Databases Using Greedy Method
Non Relational database is a database used to store large amounts of data. Improving the performance of a database system is one of the key research issues. As publications of context are rising, a new vertical partitioning scheme is proposed to handle better data load and to improve performance for non relational databases. In the proposed work, an algorithm is developed by concatenating the v...
متن کاملOptimization of Query Processing through Constrained Vertical Partitioning of Relational Tables
Vertical partitioning is an effective way of improving performance in the database systems where a significant percentage of query processing time is spent on the full scans of relational tables. Vertical partitioning provides even more compelling performance gains when it is combined with the controlled replication of data in the environments where the processing of queries dominates the data ...
متن کاملVertical Fragmentation in Databases Using Data-Mining Technique
A new approach to vertical fragmentation in relational databases is proposed using association rules, a data-mining technique. Vertical fragmentation can enhance the performance of database systems by reducing the number of disk accesses needed by transactions. By adapting Apriori algorithm, a design methodology for vertical partitioning is proposed. The heuristic methodology is tested using tw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011